Efficient search of optimal Flower Constellations
نویسندگان
چکیده
We derive an analytical closed expression to compute the minimum distance (quantified by angle of separation measured from center Earth) between any two satellites located at same altitude and in circular orbits. also exploit several properties Flower Constellations (FCs) that, combined with our formula for distance, give efficient method angular satellites, all possible FCs up a given number satellites.
منابع مشابه
Flower Constellations for Telemedicine Services
Flower constellations are a particular set of satellite constellations where every satellite covers the same repeating space track. When the flower constellations are visualized on an Earth centred earth fixed reference frame, the relative orbits shows flower-shaped figures centered on the Earth. In this paper the shape and the position of a particular flower constellations has been designed fo...
متن کاملPower-Efficient Non-coherent Space-Time Constellations
We consider the problem of digital communication in a Rayleigh flat-fading environment using a multiple-antenna system, when the channel state information is available neither at the transmitter nor at the receiver. It is known that at high SNR, or when the coherence interval is much larger than the number of transmit antennas, a constellation of unitary matrices can achieve the capacity of the...
متن کاملEfficient Optimal Search of Euclidean-Cost Grids and Lattices
We describe a simple technique to speed up optimal path planning on Euclidean-cost grids and lattices. Many robot navigation planning algorithms build approximate grid representations of the environment and use Djikstra’s algorithm or A* to search the resulting embedded graph for an optimal path between given start and goal locations. However, the classical implementations of these search algor...
متن کاملThe Optimal Density of Infinite Constellations for the Gaussian Channel
The setting of a Gaussian channel without power constraints is considered. In this setting the codewords are points in an n-dimensional Euclidean space (an infinite constellation). The channel coding analog of the number of codewords is the density of the constellation points, and the analog of the communication rate is the normalized log density (NLD). The highest achievable NLD with vanishing...
متن کاملAN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS
The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Astronautica
سال: 2021
ISSN: ['1879-2030', '0094-5765']
DOI: https://doi.org/10.1016/j.actaastro.2020.10.026